Generalized Automata and Stochastic Languages
نویسندگان
چکیده
منابع مشابه
Generalized Automata and Stochastic Languages
1. Introduction. In a probabilistic automaton, as defined e.g. in [2] and [l], the initial vector as well as the transition matrices are stochastic, and the final vector consists of O's and l's only. This paper is concerned with the so-called generalized automata where the elements of the initial vector, of the final vector and of the matrices are allowed to be arbitrary real numbers. Our purpo...
متن کاملOn tally languages and generalized interacting automata
Devices of interconnected parallel acting sequential automata are investigated from a language theoretic point of view. Starting with the well-known result that each tally language acceptable by a classical one-way cellular automaton (OCA) in real-time has to be a regular language we will answer the three natural questions ‘How much time do we have to provide?’ ‘How much power do we have to plu...
متن کاملOn Tally Languages and Generalized Interacting Automata Justus-liebig- Universit at Gieeen on Tally Languages and Generalized Interacting Automata
Devices of interconnected parallel acting sequential automata are investigated from a language theoretic point of view. Starting with the well-known result that each tally language acceptable by a classical one-way cellular automaton (OCA) in real-time has to be a regular language we will answer the three natural questions`How much time do we have to provide?' `How much power do we have to plug...
متن کاملLanguages Automata and Logic
This paper is a survey on logical aspects of nite automata Central points are the connection between nite automata and monadic second order logic the Ehrenfeucht Fra ss e technique in the context of formal language theory nite automata on words and their determinization and a self contained proof of the Rabin Tree Theorem Sections and contain material presented in a lecture series to the Final ...
متن کاملPrecedence Automata and Languages
Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the well-known visibly pushdown languages, and enjoy the same nice closure properties. We introduce here Floyd automata, an equivalent operational formalism for defining FLs. This also permits to extend the class to deal with infi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1969
ISSN: 0002-9939
DOI: 10.2307/2036989